A block triangular preconditioner for a class of three-by-three block saddle point problems
نویسندگان
چکیده
This paper deals with solving a class of three-by-three block saddle point problems. The systems are solved by preconditioning techniques. Based on an iterative method, we construct upper triangular preconditioner. convergence the presented method is studied in details. Finally, some numerical experiments given to demonstrate superiority proposed preconditioner over existing ones.
منابع مشابه
On block diagonal and block triangular iterative schemes and preconditioners for stabilized saddle point problems
We review the use of block diagonal and block lower/upper triangular splittings for constructing iterative methods and preconditioners for solving stabilized saddle point problems. We introduce new variants of these splittings and obtain new results on the convergence of the associated stationary iterations and new bounds on the eigenvalues of the corresponding preconditioned matrices. We furth...
متن کاملA BDDC Preconditioner for Saddle Point Problems
The purpose of this paper is to extend the BDDC (balancing domain decomposition by constraints) algorithm to saddle point problems that arise when mixed finite element methods are used to approximate the system of incompressible Stokes equations. The BDDC algorithms are defined in terms of a set of primal continuity constraints, which are enforced across the interface between the subdomains, an...
متن کاملA Preconditioner for Generalized Saddle Point Problems
In this paper we consider the solution of linear systems of saddle point type by preconditioned Krylov subspace methods. A preconditioning strategy based on the symmetric/ skew-symmetric splitting of the coefficient matrix is proposed, and some useful properties of the preconditioned matrix are established. The potential of this approach is illustrated by numerical experiments with matrices fro...
متن کاملA New Analysis of Block Preconditioners for Saddle Point Problems
We consider symmetric saddle point matrices. We analyze block preconditioners based on the knowledge of a good approximation for both the top left block and the Schur complement resulting from its elimination. We obtain bounds on the eigenvalues of the preconditioned matrix that depend only of the quality of these approximations, as measured by the related condition numbers. Our analysis applie...
متن کاملAn Optimal Block Diagonal Preconditioner for Heterogeneous Saddle Point Problems in Phase Separation
The phase separation processes are typically modeled by Cahn-Hilliard equations. This equation was originally introduced to model phase separation in binary alloys; where phase stands for concentration of different components in alloy. When the binary alloy under preparation is subjected to a rapid reduction in temperature below a critical temperature, it has been experimentally observed that t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Japan Journal of Industrial and Applied Mathematics
سال: 2023
ISSN: ['0916-7005', '1868-937X']
DOI: https://doi.org/10.1007/s13160-022-00561-8